A graph-based MIP formulation of the International Timetabling Competition 2019

The International Timetabling Competition 2019 (ITC 2019) posed a university timetabling problem involving assigning classes to times and rooms for an entire semester while students required classes. We propose new mixed integer programming (MIP) formulation of the problem. MIP takes advantage different graph structures in conflict graphs construct strong constraints. In addition, we introduce reduction algorithm that removes redundancies from input data. show algorithm, combined with graph-based formulation, outperforms formulated by Holm et al. (A problem, 2020) thus becomes state-of-the-art ITC 2019. This paper reports which used during 2019, discusses additional approaches one can use strengthen MIP.